prime implicant


English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.

Look at other dictionaries:

  • prime implicant — noun a) A group of related 1s (implicant) on a Karnaugh map which is not subsumed by any other implicant in the same map. b) A group of related 0s (implicant) on a Karnaugh map which is not subsumed by any other implicant (of 0s) in the same map …   Wiktionary

  • essential prime implicant — noun A prime implicant on a Karnaugh map which covers at least one 1 which is not covered by any other prime implicant. Ant: non essential prime implicant …   Wiktionary

  • non-essential prime implicant — noun On a Karnaugh map: a prime implicant which does not cover any 1 which cannot covered by some other prime implicant. Ant: essential prime implicant …   Wiktionary

  • Implicant — In Boolean logic, an implicant is a covering (sum term or product term) of one or more minterms in a sum of products (or maxterms in a product of sums) of a boolean function. Formally, a product term P in a sum of products is an implicant of the… …   Wikipedia

  • Quine–McCluskey algorithm — The Quine–McCluskey algorithm (or the method of prime implicants) is a method used for minimization of boolean functions which was developed by W.V. Quine and Edward J. McCluskey. It is functionally identical to Karnaugh mapping, but the tabular… …   Wikipedia

  • Petrick's method — In Boolean algebra, Petrick s method (also known as the branch and bound method) is a technique for determining all minimum sum of products solutions from a prime implicant chart. Petrick s method is very tedious for large charts, but it is easy… …   Wikipedia

  • Willard Van Orman Quine — Unreferenced|date=August 2007 Infobox Philosopher region = Western Philosophy era = 20th century philosophy color = #B0C4DE image caption = Willard Van Orman Quine name = Willard Van Orman Quine birth = birth date|mf=yes|1908|6|25 death = death… …   Wikipedia

  • Circuit minimization — In Boolean algebra, circuit minimization is the problem of obtaining the smallest logic circuit (Boolean formula) that represents a given Boolean function or truth table. The general circuit minimization problem is believed to be intractable,[1]… …   Wikipedia

  • простая импликанта — — [http://www.iks] Тематики электросвязь, основные понятия EN prime implicant …   Справочник технического переводчика

  • List of mathematics articles (I) — NOTOC Ia IA automorphism ICER Icosagon Icosahedral 120 cell Icosahedral prism Icosahedral symmetry Icosahedron Icosian Calculus Icosian game Icosidodecadodecahedron Icosidodecahedron Icositetrachoric honeycomb Icositruncated dodecadodecahedron… …   Wikipedia

  • List of Boolean algebra topics — This is a list of topics around Boolean algebra and propositional logic. Contents 1 Articles with a wide scope and introductions 2 Boolean functions and connectives 3 Examples of Boolean algebras …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.